منابع مشابه
A Criterion for Almost Alternating Links to Be Non-splittable
The notion of almost alternating links was introduced by C. Adams et al ([1]). Here we give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. This solves a question asked in [1]. A partial solution for special almost alternating links has been obtained by M. Hirasawa ([4]). As its applications, Theorem 2.3 gives us a way to see if a given almost a...
متن کاملAlmost Alternating Sums
as N → ∞ is not transparent. The random walk ∑Nn=1 wn, where the wn are independent random variables taking the values ±1 with equal probability, is known [22] to typically have absolute value around c √ N , for an appropriate constant c and large N . Knowing this, and knowing that for irrational α the sequence ⌊nα⌋ is “random-ish” modulo 2, a natural guess is that |SN (α)| is also around √ N ....
متن کاملA pr 1 99 9 ALMOST ALTERNATING DIAGRAMS AND FIBERED LINKS IN S
The concept of Murasugi sum (for the definition, see Section 2) of Seifert surfaces in the 3-sphere S was introduced by K. Murasugi, and it has been playing important roles in the studies of Seifert surfaces and links. The Murasugi sum is known to be natural in many senses, and in particular the following is known. (We say that a Seifert surface R is a fiber surface if ∂R is a fibered link and ...
متن کاملJones Polynomials of Alternating Links
Let Jk(*) = nrtr + • ■ • + asta, r > s, be the Jones polynomial of a knot if in S3. For an alternating knot, it is proved that r — s is bounded by the number of double points in any alternating projection of K. This upper bound is attained by many alternating knots, including 2-bridge knots, and therefore, for these knots, r — s gives the minimum number of double points among all alternating pr...
متن کاملThe Asymptotics of Almost Alternating Permutations
The goal of this paper is to study the asymptotic behavior of almost alternating permutations, that is, permutations that are alternating except for a finite number of exceptions. Let β l1 lk denote the number of permutations which consist of l1 ascents, l2 descents, l3 ascents, and so on. By combining the Viennot triangle and the boustrophedon transform, we obtain the exponential generating fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1992
ISSN: 0166-8641
DOI: 10.1016/0166-8641(92)90130-r